The Minimum Energy Expenditure Shortest Path Method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Minimum Energy Expenditure Shortest Path Method

This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path. Given a simple environment in which a character has the ability to perform actions related to locomotion, such as walking and stair stepping, current techniques execute the shortest path based on the length of the extracte...

متن کامل

Rethinking Shortest Path: An Energy Expenditure Approach

Considering that humans acting in constrained environments do not always plan according to shortest path criteria; rather, they conceptually measure the path which minimises the amount of expended energy. Hence, virtual characters should be able to execute their paths according to planning methods based not on path length but on the minimisation of actual expended energy. Thus, in this paper, w...

متن کامل

On the Minimum Eccentricity Shortest Path Problem

Find a shortest path P with minimum eccentricity, Find a shortest path P with minimum eccentricity,

متن کامل

cient Algorithms for the Minimum Shortest Path

Given an undirected graph G = (V;E) with positive edge weights (lengths) w : E ! < + , a set of terminals (sinks) N V , and a unique root node r 2 N , a shortest-path Steiner arborescence (simply called an arborescence in the following) is a Steiner tree rooted at r spanning all terminals in N such that every sourceto-sink path is a shortest path in G. Given a triple (G;N; r), the MinimumShorte...

متن کامل

The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint

In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graphics Tools

سال: 2013

ISSN: 2165-347X,2165-3488

DOI: 10.1080/2165347x.2013.872586